Combinatorics of inductively factored arrangements
نویسندگان
چکیده
منابع مشابه
Inductively Factored Signed-graphic Arrangements of Hyperplanes
In 1994, Edelman and Reiner characterized free and supersolvable hyperplane arrangements in the restricted interval [An−1, Bn]. In this paper, we give a characterization of inductively factored arrangements in this interval, and show that the same characterization also describes factored arrangements in this interval. These results use the compact notation of signed graphs introduced by Zaslavsky.
متن کاملFactored Facade Acquisition using Symmetric Line Arrangements
We introduce a novel framework for image-based 3D reconstruction of urban buildings based on symmetry priors. Starting from image-level edges, we generate a sparse and approximate set of consistent 3D lines. These lines are then used to simultaneously detect symmetric line arrangements while refining the estimated 3D model. Operating both on 2D image data and intermediate 3D feature representat...
متن کاملTopology and combinatorics of real line arrangements
We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in P. Such pair of arrangements has an additional property: they admit conjugated equations on the ring of polynomials over Q( √ 5).
متن کاملCombinatorics and invariants of toric arrangements
Given the toric (or toral) arrangement defined by a root system Φ, we classify and count its components of each dimension. We show how to reduce to the case of 0-dimensional components, and in this case we give an explicit formula involving the maximal subdiagrams of the affine Dynkin diagram of Φ. Then we compute the Euler characteristic and the Poincaré polynomial of the complement of the arr...
متن کاملCombinatorics of Line Arrangements and Characteristic Varieties
The complement M of a complex line arrangementA in C gives rise to combinatorial data, namely, the intersection lattice L(A). We prove that if the arrangement A is the complexification of a real arrangement, the characteristic varieties of complex rank one local systems on M are determined by the combinatorics of the arrangement A.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1995
ISSN: 0195-6698
DOI: 10.1016/0195-6698(95)90032-2